A Local Stability Supported Parallel Distributed Constraint Optimization Algorithm
نویسندگان
چکیده
منابع مشابه
A Local Stability Supported Parallel Distributed Constraint Optimization Algorithm
This paper presents a new distributed constraint optimization algorithm called LSPA, which can be used to solve large scale distributed constraint optimization problem (DCOP). Different from the access of local information in the existing algorithms, a new criterion called local stability is defined and used to evaluate which is the next agent whose value needs to be changed. The propose of loc...
متن کاملAnytime local search for distributed constraint optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small problems. Distributed local search algorithms can be used for solving DisCOPs. However, because of the differences between the global evaluation of a system’s state and the private evaluation of states by agents, agents ar...
متن کاملA Scalable Algorithm to Solve Distributed Constraint Optimization
Recently, Distributed Constraint Optimization Problems (DCOP) have been drawing a growing body of attention as an important research area in multi agent systems as a large body of real problems can be modeled by them. The primary goal of this research is to design a distributed and effective algorithm to solve DCOP. There are various criteria that measure the efficiency of DCOP algorithms, but ...
متن کاملA privacy-preserving algorithm for distributed constraint optimization
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of s...
متن کاملDistributed Subgradient Algorithm for Multi-agent Convex Optimization with Local Constraint Sets
This paper considers a distributed constrained optimization problem, where the objective function is the sum of local objective functions of distributed nodes in a network. The estimate of each agent is restricted to different convex sets. To solve this optimization problem which is not necessarily smooth, we study a novel distributed projected subgradient algorithm for multi-agent optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/734975